Regular Generalizedω-Closed Sets

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Soft regular generalized b-closed sets in soft topological spaces

The main purpose of this paper is to introduce and study new classes of soft closed sets like soft regular generalized b-closed sets in soft topological spaces (briefly soft rgb-closed set) Moreover, soft rg-closed, soft gpr-closed, soft gb-closed, soft gsp-closed, soft g$alpha$-closed, soft g$alpha$b-closed, and soft sgb-closed sets in soft topological spaces are introduced in this paper and w...

متن کامل

On Regular Generalized $delta$-closed Sets in Topological Spaces

In this paper a new class of sets called  regular generalized  $delta$-closed set (briefly rg$delta$-closed set)is introduced and its properties are studied. Several examples are provided to illustrate the behaviour of these new class of sets.

متن کامل

On Generalized Regular Closed Sets

The aim of this paper is to introduce the concept of generalized regular closed sets and study some of its properties . The corresponding topological space formed by the family of these sets is also studied. It may be noted that regular closed set doesn’t forms even a supra topological space. Various researchers had studied the concept of generalized closed sets and regular generalized closed s...

متن کامل

Regular Generalized ω-Closed Sets

Recommended by Lokenath Debnath In 1982 and 1970, Hdeib and Levine introduced the notions of ω-closed set and generalized closed set, respectively. The aim of this paper is to provide a relatively new notion of generalized closed set, namely, regular generalized ω-closed, regular generalized ω-continuous, a-ω-continuous, and regular generalized ω-irresolute maps and to study its fundamental pro...

متن کامل

Regular closed sets of permutations

Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets to be enumerated by rational generating functions. As a consequence we give the first non-trivial examples of pattern closed sets of permutations all of whose closed subclasses ha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences

سال: 2007

ISSN: 0161-1712,1687-0425

DOI: 10.1155/2007/16292